2010 IEEE International Conference on Granular Computing

Hierarchical Classification with Dynamic%2DThreshold SVM Ensemble for Gene Function Prediction.

A probabilistic topic%2Dconnection model for automatic image annotation.

Metadata Effectiveness A Comparison between User%2DCreated Social Tags and Author%2DProvided Metadata.

The topic%2Dperspective model for social tagging systems.

Answer Diversification for Complex Question Answering on the Web.



Learning an enriched representation from unlabeled data for protein%2Dprotein interaction extraction.

Exploratory analysis of protein translation regulatory networks using hierarchical random graphs.

MOACO Biclustering of gene expression data.

Mining hidden connections among biomedical concepts from disjoint biomedical literature sets through semantic%2Dbased association rule.

Maintaining Mappings between Conceptual Models and Relational Schemas.

A path%2Dtraceable query routing mechanism for search in unstructured peer%2Dto%2Dpeer networks.

Proceedings of the 18th ACM Conference on Information and Knowledge Management

Exploratory Analysis of Protein Translation Regulatory Networks Using Hierarchical Random Graphs.

Microarray Biclustering with Crowding Based MOACO.

Data mining in bioinformatics challenges and opportunities.

Multi%2Dobjective ant colony optimization biclustering of microarray data.

A new rough set model for knowledge acquisition in incomplete information system.

Predicting gene function with positive and unlabeled examples.

AskDragon a redundancy%2Dbased factoid question answering system with lightweight local context analysis.

Exploiting Wikipedia as external knowledge for document clustering.
In traditional text clustering methods, documents are represented as “bags of words ” without considering the semantic information of each document. For instance, if two documents use different collections of core words to represent the same topic, they may be falsely assigned to different clusters due to the lack of shared core words, although the core words they use are probably synonyms or semantically associated in other forms. The most common way to solve this problem is to enrich document representation with the background knowledge in an ontology. There are two major issues for this approach: (1) the coverage of the ontology is limited, even for WordNet or Mesh, (2) using ontology terms as replacement or additional features may cause information loss, or introduce noise. In this paper, we present a novel text clustering method to address these two issues by enriching document representation with Wikipedia concept and
Addressing the Variability of Natural Language Expression in Sentence Similarity with Semantic Structure of the Sentences.

Spatial Weighting for Bag%2Dof%2DVisual%2DWords and Its Application in Content%2DBased Image Retrieval.

Spatial Weighting for Bag%2Dof%2DVisual%2DWords and Its Application in Content%2DBased Image Retrieval.

Scalable Dynamic Fuzzy Biomolecular Network Models for Large Scale Biology.

Biclustering of microarray data with MOSPO based on crowding distance.

AI for Global Disease Surveillance.

Mining
We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empirically evaluate their performance using synthetic data. Two of the proposed algorithms, AprioriSome and AprioriAll, have comparable performance, albeit AprioriSome performs a little better when the minimum number of customers that must support a sequential pattern is low. Scale-up experiments show that both AprioriSome and AprioriAll scale linearly with the number of customer transactions. They also have excellent scale-up properties with respect to the number of transactions per customer and the number of items in a transaction. 1 Introduction Database mining is motivated by the decision support problem faced by most large retail organizations. Progress in bar-code technology has made it po...
Microarray Gene Cluster Identification and Annotation Through Cluster Ensemble and EM%2DBased Informative Textual Summarization.

A Dynamic and Semantically%2DAware Technique for Document Clustering in Biomedical Literature.

2008 IEEE International Conference on Bioinformatics and Biomedicine



Round%2DTrip Engineering for Maintaining Conceptual%2DRelational Mappings.
Abstract. Conceptual-relational mappings between conceptual models and relational schemas have been used increasingly to achieve interoperability or overcome impedance mismatch in modern data-centric applications. However, both schemas and conceptual models evolve over time to accommodate new information needs. When the conceptual model (CM) or the schema associated with a mapping evolved, the mapping needs to be updated to reflect the new semantics in the CM/schema. In this paper, we propose a round-trip engineering solution which essentially synchronizes models by keeping them consistent for maintaining conceptualrelational mappings. First, we define the consistency of a conceptualrelational mapping through “semantically compatible ” instances. Next, we carefully analyze the knowledge encoded in the standard database design process and develop round-trip algorithms for maintaining the consistency of conceptual-relational mappings under evolution. Finally, we conduct a comprehensive set of experiments. The results show that our solution is efficient and provides significant benefits in comparison to the mapping reconstructing approach. [keywords: Round-trip Engineering, Mapping Maintenance] 1
Document Clustering by Semantic Smoothing and Dynamic Growing Cell Structure %28DynGCS%29 for Biomedical Literature.

The Evaluation of Sentence Similarity Measures.

A Finite Ranked Poset and its Application in Visualization of Association Rules.

Multi%2Dobjective Evolutionary Algorithm for Mining 3D Clusters in Gene%2Dsample%2Dtime Microarray Data.

Web Clustering based on the Information of Sibling Pages.

Combination of Granules
Abstract—In this paper, we are concerned with the granular representation of mappings (or experimental data) coming in the form X ‘H I “ (for one-dimensional cases) and X ‘H I “ (for multivariable cases) with being a set of real numbers. As the name implies, a granular mapping is defined over information granules and maps them into a collection of granules expressed in some output space. The design of the granular mapping is discussed in the case of set and fuzzy set-based granulation. The proposed development is regarded as a two-phase process that comprises: 1) a definition of an interaction between information granules and experimental evidence or existing numeric mapping and 2) the use of these measures of interaction in building an explicit expression for the granular mapping. We show how to develop information granules in case of multidimensional numeric data by resorting to fuzzy clustering (fuzzy C-means). Experimental results serve as an illustration of the proposed approach. Index Terms—Fuzzy clustering, fuzzy relational equations, granular
Utilizing Semantic
G. Smith and W. Stuerzlinger  Dept. of Computer Science, York University, Toronto, Canada  http://www.cs.yorku.ca/~wolfgang  Abstract  Content creation for computer graphics applications is a laborious process that requires skilled personnel. One fundamental problem is that manipulation of 3D objects with 2D user interfaces is very difficult for non-experienced users.  In this paper, we describe a system that uses semantic constraints to restrict object motion in a 3D scene, making interaction much simpler and more intuitive. We compare three different levels of semantic constraints in a 3D scene manipulation program with a 2D user interface. We show that the presented techniques are significantly more efficient than alternate techniques, which do not use semantics in their constraints. To our knowledge, this is the first evaluation of 3D manipulation techniques with 2D devices and constraints.  This extended abstract describes only preliminary results from our currently incomplete use...
Semantic representation in text classification using topic signature mapping.

Semantic Smoothing for Bayesian Text Classification with Small Training Data.
Bayesian text classifiers face a common issue which is referred to as data sparsity problem, especially when the size of training data is very small. The frequently used Laplacian smoothing and corpus-based background smoothing are not effective in handling it. Instead, we propose a novel semantic smoothing method to address the sparse problem. Our method extracts explicit topic signatures (e.g. words, multiword phrases, and ontologybased concepts) from a document and then statistically maps them into single-word features. We conduct comprehensive experiments on three testing collections (OHSUMED, LATimes, and 20NG) to compare semantic smoothing with other approaches. When the size of training documents is small, the bayesian classifier with semantic smoothing not only outperforms the classifiers with background smoothing and Laplacian smoothing, but also beats the state-of-the-art active learning classifiers and SVM classifiers. In this paper, we also compare three types of topic signatures with respect to their effectiveness and efficiency for semantic smoothing. 
A comparative evaluation of different link types on enhancing document clustering.
With a growing number of works utilizing link information in enhancing document clustering, it becomes necessary to make a comparative evaluation of the impacts of different link types on document clustering. Various types of links between text documents, including explicit links such as citation links and hyperlinks, implicit links such as co-authorship links, and pseudo links such as content similarity links, convey topic similarity or topic transferring patterns, which is very useful for document clustering. In this study, we adopt a Relaxation Labeling (RL)based clustering algorithm, which employs both content and linkage information, to evaluate the effectiveness of the aforementioned types of links for document clustering on eight datasets. The experimental results show that linkage is quite effective in improving content-based document clustering. Furthermore, a series of interesting findings regarding the impacts of different link types on document clustering are discovered through our experiments.
Latent Semantic Space for Web Clustering.

Methods for evaluating gene expression from Affymetrix microarray datasets.

Recursive Fuzzy Granulation for Gene Subsets Extraction and Cancer Classification.

Medical Document Clustering Using Ontology%2DBased Term Similarity Measures.

A Graph%2DBased Biomedical Literature Clustering Approach Utilizing Term%27s Global and Local Importance Information.

A Comparison and Scenario Analysis of Leading Data Mining Software.

Towards effective document clustering A constrained K%2Dmeans based approach.

Emerging Technologies in Knowledge Discovery and Data Mining

Using Two%2DStage Concept%2DBased Singular Value Decomposition Technique as a Query Expansion Strategy.

A New Method of Cluster%2DBased Topic Language Model for Genomic IR.

Biomedical Literature Mining.
Abstract. The amount of information about the genome, transcriptome and proteome, forms a problem for the scientific community: how to find the right information in a reasonable amount of time. Most research aiming to solve this problem, however, concentrate on a certain organism or a very limited dataset. Complementary to those algorithms, we developed CONAN, a system which provides a full-scale approach, tailored to experimentalists, designed to combine several information extraction methods and connect the outcome of these methods to gather novel information. Its methods include tagging of gene/protein names, finding interaction and mutation data, tagging of biological concepts, linking to MeSH and Gene Ontology terms, which can all be found back by querying the system. We present a full-scale approach that will ultimately cover all of PubMed/MEDLINE. We show that this universality has no effect on quality: our system performs as well as existing systems. 1
Ontology Based Clustering for Improving Genomic IR.

A segment%2Dbased hidden markov model for real%2Dsetting pinyin%2Dto%2Dchinese conversion.

A Comparative Study of Ontology Based Term Similarity Measures on PubMed Document Clustering.
xiaohua.zhou @ drexel.edu Abstract. Recent research shows that ontology as background knowledge can improve document clustering quality with its concept hierarchy knowledge. Previous studies take term semantic similarity as an important measure to incorporate domain knowledge into clustering process such as clustering initialization and term re-weighting. However, not many studies have been focused on how different types of term similarity measures affect the clustering performance for a certain domain. In this paper, we conduct a comparative study on how different semantic similarity measures of term including path based similarity measure, information content based similarity measure and feature based similarity measure affect document clustering. We evaluate term re-weighting as an important method to integrate domain ontology to clustering process. Meanwhile, we apply k-means clustering on one real-world text dataset, our own corpus generated from PubMed. Experiment results on 8 different semantic measures have shown that: (1) there is no a certain type of similarity measures that significantly outperforms the others; (2) Several similarity measures have rather more stable performance than the others; (3) term re-weighting has positive effects on medical document clustering, but might not be significant when documents are short of terms.
Utilization of Global Ranking Information in Graph%2D Based Biomedical Literature Clustering.

An Incremental Algorithm for Mining Default Definite Decision Rules from Incomplete Decision Tables.

Algorithms for Different Approximations in Incomplete Information Systems with Maximal Compatible Classes as Primitive Granules.

An Incremental Algorithm for Mining Default Definite Decision Rules from Incomplete Decision Tables.

Mining and Dynamic Simulation of Sub%2DNetworks from Large Biomolecular Networks.

Dragon Toolkit Incorporating Auto%2DLearned Semantic Knowledge into Large%2DScale Text Retrieval and Mining.
The majority of text retrieval and mining techniques are still based on exact feature (e.g. words) matching and unable to incorporate text semantics. Many researchers believe that the extension with semantic knowledge could improve the results and various methods (most of them are heuristic) have been proposed to account for concept hierarchy, synonymy, and other semantic relationships. However, the results with such semantic extension have been mixed, ranging from slight improvements to decreases in effectiveness, mostly likely due to the lack of a formal framework. Instead, we propose a novel method to address the semantic extension within the framework of language modeling. Our method extracts explicit topic signatures from documents and then statistically maps them into singleword features. The incorporation of semantic knowledge then reduces to the smoothing of unigram language models using semantic knowledge. The dragon toolkit reflects our method and its effectiveness is demonstrated by three tasks, text retrieval, text classification, and text clustering. 1.
Semantic Smoothing of Document Models for Agglomerative Clustering.
In this paper, we argue that the agglomerative clustering with vector cosine similarity measure performs poorly due to two reasons. First, the nearest neighbors of a document belong to different classes in many cases since any pair of documents shares lots of “general ” words. Second, the sparsity of class-specific “core ” words leads to grouping documents with the same class labels into different clusters. Both problems can be resolved by suitable smoothing of document model and using Kullback-Leibler divergence of two smoothed models as pairwise document distances. Inspired by the recent work in information retrieval, we propose a novel context-sensitive semantic smoothing method that can automatically identifies multiword phrases in a document and then statistically map phrases to individual document terms. We evaluate the new model-based similarity measure on three datasets using complete linkage criterion for agglomerative clustering and find out it significantly improves the clustering quality over the traditional vector cosine measure. 1
Workshop BioDM%2707 %2D An Overview.

A New Decision Tree Classification Method for Mining High%2DSpeed Data Streams Based on Threaded Binary Search Trees.

A coherent graph%2Dbased semantic clustering and summarization approach for biomedical literature and a new summarization evaluation method.

Mining and state%2Dspace modeling and verification of sub%2Dnetworks from large%2Dscale biomolecular networks.

Integration of association rules and ontologies for semantic query expansion.

A Novel Approach for Mining and Fuzzy Simulation of Subnetworks From Large Biomolecular Networks.
www.library.drexel.edu The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as research, teaching and private study. For these limited purposes, you may reproduce (print, download or make copies) the Material without prior permission. All copies must include any copyright notice originally included with the Material. You must seek permission from the authors or copyright owners for all uses that are not allowed by fair use and other provisions of the U.S. Copyright Law. The responsibility for making an independent legal assessment and securing any necessary permission rests with persons desiring to reproduce or use the Material.
Topic Signature Language Models for Ad hoc Retrieval.
Abstract—Semantic smoothing, which incorporates synonym and sense information into the language models, is effective and potentially significant to improve retrieval performance. Previously implemented semantic smoothing models such as the translation model have shown good experimental results. However, these models are unable to incorporate contextual information. To overcome this limitation, we propose a novel context-sensitive semantic smoothing method that decomposes a document into a set of weighted context-sensitive topic signatures and then maps those topic signatures into query terms. The language model with such a contextsensitive semantic smoothing is referred to as the topic signature language model. In detail, we implement two types of topic signatures, depending on whether ontology exists in the application domain. One is the ontology-based concept and the other is the multiword phrase. The mapping probabilities from each topic signature to individual terms are estimated through the EM algorithm. Document models based on topic signature mapping are then derived. The new smoothing method is evaluated on theTREC 2004/ 2005 Genomics Track with ontology-based concepts, as well as the TREC Ad Hoc Track (Disks 1, 2, and 3) with multiword phrases. Both experiments show significant improvements over the two-stage language model, as well as the language model with contextinsensitive semantic smoothing. Index Terms—Information retrieval, language model, semantic smoothing, topic signature, concept, multiword phrase. 1
Data Mining and Predictive Modeling of Biomolecular Network from Biomedical Literature Databases.
www.library.drexel.edu The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as research, teaching and private study. For these limited purposes, you may reproduce (print, download or make copies) the Material without prior permission. All copies must include any copyright notice originally included with the Material. You must seek permission from the authors or copyright owners for all uses that are not allowed by fair use and other provisions of the U.S. Copyright Law. The responsibility for making an independent legal assessment and securing any necessary permission rests with persons desiring to reproduce or use the Material.
Diminishing downsides of Data Mining.

Prediction of the disulphide bridges in proteins using SVM.

Biomedical ontology improves biomedical literature clustering performance a comparison study.

Transactions on Computational Systems Biology V

Foundations and Novel Approaches in Data Mining
Summary. The study of foundations of data mining may be viewed as a scientific inquiry into the nature of data mining and the scope of data mining methods. There is not enough attention paid to the study of the nature of data mining, or its philosophical foundations. It is evident that the conceptual studies of data mining as a scientific research field, instead of as a collection of isolated algorithms, are needed for a further development of the complete field. A three-layer conceptual framework is thus proposed, consisting of the philosophy layer, the technique layer and the application layer. Each layer focuses on different types of fundamental questions regarding data mining, and they jointly form a complete characterization of the field. The layered framework is demonstrated by applying it to three sub-fields of data mining, classification, measurements, and explanation-oriented data mining. They exemplify three popular views of data mining, i.e., function-oriented, theoryoriented and procedure-oriented, respectively. 1.1
A Language Modeling Text Mining Approach to the Annotation of Protein Community.

Biomedical Ontology MeSH Improves Document Clustering Qualify on MEDLINE Articles A Comparison Study.
www.library.drexel.edu The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as research, teaching and private study. For these limited purposes, you may reproduce (print, download or make copies) the Material without prior permission. All copies must include any copyright notice originally included with the Material. You must seek permission from the authors or copyright owners for all uses that are not allowed by fair use and other provisions of the U.S. Copyright Law. The responsibility for making an independent legal assessment and securing any necessary permission rests with persons desiring to reproduce or use the Material. Please direct questions to archives@drexel.edu
Integration of cluster ensemble and EM based text mining for microarray gene cluster identification and annotation.
In this paper, we design and develop a unified system GE-Miner (Gene Expression Miner) to integrate cluster ensemble, text clustering and multi document summarization and provide an environment for comprehensive gene expression data analysis. We present a novel cluster ensemble approach to generate high quality gene cluster. In our text summarization module, given a gene cluster, our Expectation Maximization (EM) based algorithm can automatically identify subtopics and extract most probable terms for each topic. Then, the extracted top k topical terms from each subtopic are combined to form the biological explanation of each gene cluster. Experimental results demonstrate that our system can obtain high quality clusters and provide informative key terms for the gene clusters.
Relation%2DBased Document Retrieval for Biomedical Literature Databases.
Abstract. In this paper, we explore the direct use of relations in information retrieval for precision-focused biomedical literature search. A relation is defined as a pair of two concepts which are semantically and syntactically related to each other. Unlike the traditional term-based IR models, our model represents a document by a set of controlled concepts and their binary relations. Since document level co-occurrence of two concepts, in many cases, does not mean this document really addresses their relationships, the direct use of relation may improve the precision of very specific search, e.g. searching documents that mention genes regulated by Smad4. For this purpose, we develop a generic ontology-based approach to extract concepts and their relations; a prototyped IR search. We then use this novel IR system to improve the retrieval result of all official runs in TREC-2004 Genomics Track. The experiment shows promising performance of relation-based IR. The mean of
A Coherent Biomedical Literature Clustering and Summarization Approach Through Ontology%2DEnriched Graphical Representations.
www.library.drexel.edu The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as research, teaching and private study. For these limited purposes, you may reproduce (print, download or make copies) the Material without prior permission. All copies must include any copyright notice originally included with the Material. You must seek permission from the authors or copyright owners for all uses that are not allowed by fair use and other provisions of the U.S. Copyright Law. The responsibility for making an independent legal assessment and securing any necessary permission rests with persons desiring to reproduce or use the Material.
Using Concept%2DBased Indexing to Improve Language Modeling Approach to Genomic IR.

Using UMLS%2Dbased Re%2DWeighting Terms as a Query Expansion Strategy.
Abstract—Search engines have significantly improved the efficiency of bio-medical literature searching. These search engines, however, could return many irrelevant results to the intention of the user’s query. To improve precision and recall, various query expansion strategies are widely used. In this paper, we explore the three widely used query expansion strategies-local analysis, global analysis, and ontology-based term reweighting across various search engines. Through experiments, we show that ontology-based term re-weighting works best. Term re-weighting reformulates queries with selection of key original query terms and re-weights these terms and their associated synonyms from UMLS. The results of experiments show that with LUCENE and LEMUR, the average precision is enhanced by up to 20.3 % and 12.1%, respectively, compared to the baseline runs. We believe the principles of this term re-weighting strategy may be extended and utilized in other bio-medical domains. Index Terms—query expansion strategy, term re-weighting, UMLS, ontology I.
Object oriented modeling of protein translation system.

Ensembles of classifiers based on rough sets theory and set%2Doriented database operations.
Abstract—In this paper we present a new approach to construct a good ensemble of classifiers for data mining applications based on rough set theory and database set operations. We borrow the main ideas of rough set theory and redefine them based on the database theory to take advantage of the very efficient set-oriented database operation. Our method first computes a set of reducts which include all the necessary attributes required for the decision categories. For each reduct, a reduct table is generated by removing those attributes which are not in the reduct. Next a novel rule induction algorithm is used to compute the maximal generalized rules for each reduct table and a set of reduct classifiers is formed based on the corresponding reducts. Our rule induction algorithm adopts the “conquer-without-separating “ strategy to generate a set of global best rules from the data set. The experimental results indicates that the rough set based approach is very promising for ensemble of classifiers. Index Terms — rough set theory, ensemble of classifiers, database
Semantic Smoothing for Model%2Dbased Document Clustering.
A document is often full of class-independent “general ” words and short of class-specific “core” words, which leads to the difficulty of document clustering. We argue that both problems will be relieved after suitable smoothing of document models in agglomerative approaches and of cluster models in partitional approaches, and hence improve clustering quality. To the best of our knowledge, most modelbased clustering approaches use Laplacian smoothing to prevent zero probability while most similarity-based approaches employ the heuristic TF*IDF scheme to discount the effect of “general ” words. Inspired by a series of statistical translation language model for text retrieval, we propose in this paper a novel smoothing method referred to as context-sensitive semantic smoothing for document clustering purpose. The comparative experiment on three datasets shows that model-based clustering approaches with semantic smoothing is effective in improving cluster quality. 1.
Integration of Instance%2DBased Learning and Text Mining for Identification of Potential Virus%2FBacterium as Bio%2Dterrorism Weapons.

A comprehensive comparison study of document clustering for a biomedical digital library MEDLINE.
www.library.drexel.edu The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as research, teaching and private study. For these limited purposes, you may reproduce (print, download or make copies) the Material without prior permission. All copies must include any copyright notice originally included with the Material. You must seek permission from the authors or copyright owners for all uses that are not allowed by fair use and other provisions of the U.S. Copyright Law. The responsibility for making an independent legal assessment and securing any necessary permission rests with persons desiring to reproduce or use the Material. Please direct questions to archives@drexel.edu
Integration of semantic%2Dbased bipartite graph representation and mutual refinement strategy for biomedical literature clustering.

Clustering Large Collection of Biomedical Literature Based on Ontology%2DEnriched Bipartite Graph Representation and Mutual Refinement Strategy.
Abstract. In this paper we introduce a novel document clustering approach that solves some major problems of traditional document clustering approaches. Instead of depending on traditional vector space model, this approach represents a set of documents as bipartite graphs using domain knowledge in ontology. In this representation, the concepts of the documents are classified according to their relationships with documents that are reflected on the bipartite graph. Using the concept groups, documents are clustered based on the concepts ’ contribution to each document. Through the mutual-refinement relationship with concept groups and document groups, the two groups are recursively refined. Our experimental results on MEDLINE articles show that our approach outperforms two leading document clustering algorithms: BiSecting K-means and CLUTO. In addition to its decent performance, our approach provides a meaningful explanation for each document cluster by identifying its most contributing concepts, thus helps users to understand and interpret documents and clustering results. 1
MaxMatcher Biological Concept Extraction Using Approximate Dictionary Lookup.
Abstract. Dictionary-based biological concept extraction is still the state-ofthe-art approach to large-scale biomedical literature annotation and indexing. The exact dictionary lookup is a very simple approach, but always achieves low extraction recall because a biological term often has many variants while a dictionary is impossible to collect all of them. We propose a generic extraction approach, referred to as approximate dictionary lookup, to cope with term variations and implement it as an extraction system called MaxMatcher. The basic idea of this approach is to capture the significant words instead of all words to a particular concept. The new approach dramatically improves the extraction recall while maintaining the precision. In a comparative study on GENIA corpus, the recall of the new approach reaches a 57 % recall while the exact dictionary lookup only achieves a 26 % recall. 1
Expanding Tolerance RST Models Based on Cores of Maximal Compatible Blocks.

Mining and analyzing the topological structure of protein%2Dprotein interaction networks.

A Semantic Approach for Mining Hidden Links from Complementary and Non%2Dinteractive Biomedical Literature.

Context%2Dsensitive semantic smoothing for the language modeling approach to genomic IR.
Semantic smoothing, which incorporates synonym and sense information into the language models, is effective and potentially significant to improve retrieval performance. The implemented semantic smoothing models, such as the translation model which statistically maps document terms to query terms, and a number of works that have followed have shown good experimental results. However, these models are unable to incorporate contextual information. Thus, the resulting translation might be mixed and fairly general. To overcome this limitation, we propose a novel context-sensitive semantic smoothing method that decomposes a document or a query into a set of weighted context-sensitive topic signatures and then translate those topic signatures into query terms. In detail, we solve this problem through (1) choosing concept pairs as topic signatures and adopting an ontology-based approach to extract concept pairs; (2) estimating the translation model for each topic signature using the EM algorithm; and (3) expanding document and query models based on topic signature translations. The new smoothing method is evaluated on TREC 2004/05 Genomics Track collections and significant improvements are obtained. The MAP (mean average precision) achieves a 33.6 % maximal gain over the simple language model, as well as a 7.8 % gain over the language model with context-insensitive semantic smoothing.
Making Better Sense of the Demographic Data Value in the Data Mining Procedure.

GE%2DMiner integration of cluster ensemble and text mining for comprehensive gene expression analysis.

Anti%2Dparallel Coiled Coils Structure Prediction by Support Vector Machine Classification.

Relation%2DBased Document Retrieval for Biomedical IR.

A semi%2Dsupervised efficient learning approach to extract biological relationships from web%2Dbased biomedical digital library.

2005 IEEE International Conference on Granular Computing

Rough Sets
A rapid growth of interest in rough set theory [290] and its applications  can be lately seen in the number of international workshops, conferences and  seminars that are either directly dedicated to rough sets, include the subject  in their programs, or simply accept papers that use this approach to solve  problems at hand. A large number of high quality papers on various aspects  of rough sets and their applications have been published in recent years as a  result of this attention. The theory has been followed by the development of  several software systems that implement rough set operations. In Section 12 we  present a list of software systems based on rough sets. Some of the toolkits, provide  advanced graphical environments that support the process of developing  and validating rough set classifiers. Rough sets are applied in many domains,  such as, for instance, medicine, finance, telecommunication, vibration analysis,  conflict resolution, intelligent agents, image analysis, p...
Foundations of Data Mining and knowledge Discovery
pp 1–15
Granular SVM%2DRFE Gene Selection Algorithm for Reliable Prostate Cancer Classification on Microarray Expression Data.
Selecting the most informative cancer-related genes from huge microarray gene expression data is an important and challenging bioinformatics research topic. This paper presents the novel Granular Support Vector Machines- Recursive Feature Elimination (GSVM-RFE) algorithm for the gene selection task. As a biologically meaningful hybrid method of statistical learning theory and granular computing theory, GSVM-RFE can separately eliminate irrelevant, redundant or noisy genes in different granules at different stages and can select positively related genes and negatively related genes in balance. Simulation results on the prostate cancer dataset show that GSVM-RFE is statistically much more accurate than traditional algorithms for the prostate cancer classification. More importantly, GSVM-RFE extracts a compact “perfect ” gene subset of 17 genes with 100 % accuracy. To our best knowledge, this is the first time such a “perfect ” gene subset is reported, which is expected to be helpful for prostate cancer study. 1.
An Efficient Approach to Detect a Protein Community from a Seed.

A Hybrid CI%2DBased Knowledge Discovery System on Microarray Gene Expression Data.

Mining undiscovered public knowledge from complementary and non%2Dinteractive biomedical literature through semantic pruning.

Semantic Query Expansion Combining Association Rules with Ontologies and Information Retrieval Techniques.

A semantic%2Dbased approach for mining undiscovered public knowledge from biomedical literature.

Visualization of protein%2Dprotein interaction network for knowledge discovery.

Analysis of using granules to find association rules.

SVM Classification to Predict Two Stranded Anti%2Dparallel Coiled Coils based on Protein Sequence Data.

Mining Candidate Viruses as Potential Bio%2Dterrorism Weapons from Biomedical Literature.

Integrating Text Chunking with Mixture Hidden Markov Models for Effective Biomedical Information Extraction.

An Automatic Unsupervised Querying Algorithm for Efficient Information Extraction in Biomedical Domain.

Feature Selection Based on Relative Attribute Dependency An Experimental Study.

A Data Mining Approach for Retailing Bank Customer Attrition Analysis.

Temporal rule induction for clinical outcome analysis.

Mining and analysing scale%2Dfree proteinprotein interaction network.

Wavelet transformation and cluster ensemble for gene expression analysis.

Mining novel connections from online biomedical text databases using semantic query expansion and semantic%2Drelationship pruning.

KXtractor An Effective Biomedical Information Extraction Technique Based on Mixture Hidden Markov Models.

Cluster Ensemble and Its Applications in Gene Expression Analysis.

Classification Comparison of Prediction of Solvent Accessibility From Protein Sequences.
The prediction of residue solvent accessibility from protein sequences has been studied by various methods. The direct comparison of these methods is impossible due to the variety of datasets used and the difference in structure definition. In this paper we choose 5 classification
Integration of Cluster Ensemble and Text Summarization for Gene Expression Analysis.

Managing and Mining Clinical Outcomes.

Intelligent Query Answering Based on Neighborhood Systems and Data Mining Techniques.

Feature Subset Selection Based on Relative Dependency between Attributes.

A Weighted Freshness Metric for Maintaining Search Engine Local Repository.

Ontology%2DBased Scalable and Portable Information Extraction System to Extract Biological Knowledge from Huge Collection of Biomedical Web Documents.

A New Rough Sets Model Based on Database Systems.

A data warehouse%2Fonline analytic processing framework for web usage mining and business intelligence reporting.

Discovering Cyber Communities from the WWW.

A New Computation Model for Rough Set Theory Based on Database Systems.

Bitmap Techniques for Optimizing Decision Support Queries and Association Rule Algorithms.

An Efficient Algorithm for Computing Core Attributes in Database Systems.

A New Rough Sets Model Based on Database Systems.

KPSpotter a flexible information gain%2Dbased keyphrase extraction system.

DB%2DHReduction A data preprocessing algorithm for data mining applications.

Data%2Dmining and Uncertain Reasoning An Integrated Approach %28Book Review%29.

A visualization model of interactive knowledge discovery systems and its implementations.

Comparison of Classification Methods for Customer Attrition Analysis.

From Computational Intelligence to Web Intelligence.

Using Rough Sets Theory and Database Operations to Construct a Good Ensemble of Classifiers for Data Mining Applications.

Discovering Maximal Generalized Decision Rules Through Horixontal and Vertical Data Reduction.

Learning Pseudo%2Dindependent Models Analytical and Experimental Results.
. Most algorithms to learn belief networks use single-link lookahead  search to be efficient. It has been shown that such search procedures  are problematic when applied to learning pseudo-independent (PI) models.  Furthermore, some researchers have questioned whether PI models  exist in practice.  We present two non-trivial PI models which derive from a social study  dataset. For one of them, the learned PI model reached ultimate prediction  accuracy achievable given the data only, while using slightly more  inference time than the learned non-PI model. These models provide  evidence that PI models are not simply mathematical constructs.  To develop efficient algorithms to learn PI models effectively we benefit  from studying and understanding such models in depth. We further analyze  how multiple PI submodels may interact in a larger domain model.  Using this result, we show that the RML algorithm for learning PI models  can learn more complex PI models than previously known.  Keywor...
Supervised Learning A Generalized Rough Set Approach.

Data Mining via Discretization%2C Generalization and Rough Set Feature Selection.

Learning Maximal Generalized Decision Rules via Discretization

Mining Knowledge Rules from Databases A Rough Set Approach.

Rule Discovery from Databases with Decision Matrices.

A Decision Matrix Approach for Constructing Multiple Knowledge Bases System.

Rough Sets Similarity%2DBased Learning from Databases.

Learning in Relational Databases A Rough Set Approach.

Discovery of Decision Rules in Relational Databases A Rough Set Approach.

DBROUGH A Rough Set Based Knowledge Discovery System.

Learning Data Trend Regularities From Databases in a Dynamic Environment.

An Attribute%2DOriented Rough Set Approach for Knowledge Discovery in Databases.
Knowledge Discovery in Databases (KDD) is an active research area with the promise for a high payoff in many business and scientific applications. The grand challenge of knowledge discovery in databases is to automatically process large quantities of raw data, identify the most significant and meaningful patterns, and present this knowledge in an appropriate form for achieving the user&#039;s goal. Knowledge discovery systems face challenging problems from the real-world databases which tend to be very large, redundant, noisy and dynamic. Each of these problems has been addressed to some extent within machine learning, but few, if any, systems address them all. Collectively handling these problems while producing useful knowledge efficiently and effectively is the main focus of the thesis. In this thesis, we develop an attribute-oriented rough set approach for knowledge discovery in databases. The method adopts the artificial intelligent &#034;learning from examples&#034; paradigm combined with rough...
